def main():
n, m = map(int, input().split())
if n & 1 == 0:
print('01' * (n >> 1))
else:
print('01' * (n >> 1) + '0')
if __name__ == '__main__':
main()
#include<iostream>
#include<string>
using namespace std;
int main(){
int n,m,a,b;
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>a>>b;
}
for(int i=0;i<n;i++){
i % 2 == 0 ? cout<<"0" : cout<<"1";
}
cout<<endl;
}
2B - The least round way | 1324A - Yet Another Tetris Problem |
246B - Increase and Decrease | 22E - Scheme |
1566A - Median Maximization | 1278A - Shuffle Hashing |
1666F - Fancy Stack | 1354A - Alarm Clock |
1543B - Customising the Track | 1337A - Ichihime and Triangle |
1366A - Shovels and Swords | 919A - Supermarket |
630C - Lucky Numbers | 1208B - Uniqueness |
1384A - Common Prefixes | 371A - K-Periodic Array |
1542A - Odd Set | 1567B - MEXor Mixup |
669A - Little Artem and Presents | 691B - s-palindrome |
851A - Arpa and a research in Mexican wave | 811A - Vladik and Courtesy |
1006B - Polycarp's Practice | 1422A - Fence |
21D - Traveling Graph | 1559B - Mocha and Red and Blue |
1579C - Ticks | 268B - Buttons |
898A - Rounding | 1372B - Omkar and Last Class of Math |